Visual Cryptography Schemes with Dihedral Group Access Structure for Many Images
نویسندگان
چکیده
A new construction of visual cryptography scheme (VCS) with dihedral group access structure for two shares and many secret images is proposed. Let D2n be a dihedral group of order 2n, and let {Image(τ) | τ ∈ D2n} be 2n secret images corresponding to D2n. In a VCS with dihedral group access structure, two shares (two transparencies) A and B are constructed so that for any element τ of D2n, A and τ(B) reconstruct the secret image Image(τ). This new VCS is perfect and has contrast 1/(6n2).
منابع مشابه
On the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملMAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملConstructions and Bounds for Visual Cryptography
A visual cryptography scheme for a set P of n participants is a method to encode a secret image SI into n images in such a way that any participant in P receives one image and only qualiied subsets of participants can \visually" recover the secret image, but non-qualiied sets of participants have no information, in an information theoretical sense, on SI. A \visual" recover for a set X P consis...
متن کاملMulti-pixel Visual Cryptography for color images with Meaningful Shares
Visual cryptography technique for black and white images (Basic) introduced by Naor and Shamir [1]. Any visual secret information ( pictures, text, etc) is considered as image and encryption is performed using simple algorithm to generate n copies of shares depending on type of access structure schemes[2, 6].The simplest access structure is the 2 out of 2 scheme where the secret image is encryp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007